Exploiting stoichiometric redundancies for computational efficiency and network reduction

نویسندگان

  • Brian P. Ingalls
  • Eric Bembenek
چکیده

Analysis of metabolic networks typically begins with construction of the stoichiometry matrix, which characterizes the network topology. This matrix provides, via the balance equation, a description of the potential steady-state flow distribution. This paper begins with the observation that the balance equation depends only on the structure of linear redundancies in the network, and so can be stated in a succinct manner, leading to computational efficiencies in steady-state analysis. This alternative description of steady-state behaviour is then used to provide a novel method for network reduction, which complements existing algorithms for describing intracellular networks in terms of input-output macro-reactions (to facilitate bioprocess optimization and control). Finally, it is demonstrated that this novel reduction method can be used to address elementary mode analysis of large networks: the modes supported by a reduced network can capture the input-output modes of a metabolic module with significantly reduced computational effort.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unified contraction algorithm for multi-baryon correlators on the lattice

We propose a novel algorithm for calculating multi-baryon correlation functions on the lattice. By considering the permutation of quarks (Wick contractions) and color/spinor contractions simultaneously, we construct a unified index list for the contraction where the redundancies in the original contraction are eliminated. We find that a significant reduction in the computational cost of correla...

متن کامل

Tutorial Hearing Aid Algorithms

The normal-hearing system extracts monaural and binaural features from the signals at the left and right ears in order to separate and classify sound sources. Robustness of source extraction is achieved by exploiting redundancies in the source signals (auditory scene analysis, ASA). ASA is closely related to the “Cocktail Party Effect”, i.e., the ability of normal-hearing listeners to perceive ...

متن کامل

Computational complexity reduction for BN2O networks using similarity of states

Although probabilistic inference in a general Bayesian belief network is an NP-hard prob­ lem, computation time for inference can be reduced in most practical cases by exploiting domain knowledge and by making approxi­ mations in the knowledge representation. In this paper we introduce the property of sim­ ilarity of states and a new method for ap­ proximate knowledge representation and in­ fer...

متن کامل

Submitted to the Twelfth Conference on Uncertainty in Artificial Intelligence ( UAI - 96 ) August 1 - 3 , 1996 , Portland , Oregon , USA

Although probabilistic inference in a general Bayesian belief network is an NP-hard problem, inference computation time can be reduced in most practical cases by exploiting domain knowledge and by making appropriate approximations in the knowledge representation. In this paper we introduce the property of similarity of states and a new method for approximate knowledge representation which is ba...

متن کامل

Joint Allocation of Computational and Communication Resources to Improve Energy Efficiency in Cellular Networks

Mobile cloud computing (MCC) is a new technology that has been developed to overcome the restrictions of smart mobile devices (e.g. battery, processing power, storage capacity, etc.) to send a part of the program (with complex computing) to the cloud server (CS). In this paper, we study a multi-cell with multi-input and multi-output (MIMO) system in which the cell-interior users request service...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2012